北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2010, Vol. 33 ›› Issue (5): 94-97.doi: 10.13190/jbupt.201005.94.chengsh

• 研究报告 • 上一篇    下一篇

P2P覆盖网聚类服务

程实,吴产乐,程伟,乐俊,贺莲   

  1. 武汉大学 计算机学院
  • 收稿日期:2009-11-04 修回日期:2010-05-04 出版日期:2010-08-28 发布日期:2010-06-15
  • 通讯作者: 程实 E-mail:whchsh@163.com
  • 基金资助:

    国家级.国家自然科学基金项目

P2P Overlay Network Clustering Service

  • Received:2009-11-04 Revised:2010-05-04 Online:2010-08-28 Published:2010-06-15

摘要:

为了提供有效的拓扑感知服务,论述了对等(P2P)传输损耗现象和节点距离的度量空间性质,提出了P2P覆盖网聚类服务方案. 该方案通过聚类初始化、优化接口和算法实现对P2P用户节点进行管理,维护聚类视图(CV),通过CV查询接口和CV映射算法提供跨P2P应用的拓扑感知支持. 模拟实验数据表明,该方案比现有的基于坐标空间映射的方法,能提供更精确的最近邻居推荐结果.

关键词: 对等, 聚类服务, 拓扑感知

Abstract:

To provide efficient topology aware service, the transmission loss effects and the metric space property of peer distances in peer to peer (P2P) overlay network are discussed, the P2P clustering service is proposed as well. The service solution manages P2P client peers and maintains clustering view (CV) with clustering initiation and optimization interfaces and algorithms, and supports crossapplication topologyaware with CV querying interfaces and the CV mapping algorithm. Simulation indicates that the solution provides more accurate recommendations of closest neighbors than traditional methods based on coordinate space.

Key words: peer to peer, clustering service, topologyaware

中图分类号: